computing the permanent造句

While the determinant can be computed in polynomial time by Gaussian elimination, Gaussian elimination cannot be used to compute the permanent.
The discrete logarithm problem, the quadratic residuosity problem, the RSA inversion problem, and the problem of computing the permanent of a matrix are each random self-reducible problems.
It is known that computing the permanent is impossible for logtime-uniform ACC 0 circuits, which implies that the complexity class PP is not contained in logtime-uniform ACC 0.
A refinement of these methods led to a fully polynomial time randomised approximation algorithm for computing the permanent, for which Jerrum and his co-authors received the Fulkerson Prize in 2006.
Moreover, computing the permanent of a ( 0, 1 )-matrix is probabilistic polynomial time, up to an error of ? " M ", where " M " is the value of the permanent and ? > 0 is arbitrary.
It's difficult to find computing the permanent in a sentence. 用computing the permanent造句挺难的

With his student Alistair Sinclair, Jerrum investigated the mixing behaviour of Markov chains to construct approximation algorithms for counting problems such as the computing the permanent, with applications in diverse fields such as matching algorithms, geometric algorithms, mathematical programming, statistics, physics-inspired applications, and dynamical systems.
For incomplete square " n " ?" n " boards, ( i . e . rooks are not allowed to be played on some arbitrary subset of the board's squares ) computing the number of ways to place " n " rooks on the board is equivalent to computing the permanent of a 0 1 matrix.